Discriminative Gaussian Mixture Models: A Comparison with Kernel Classifiers
نویسندگان
چکیده
We show that a classifier based on Gaussian mixture models (GMM) can be trained discriminatively to improve accuracy. We describe a training procedure based on the extended Baum-Welch algorithm used in speech recognition. We also compare the accuracy and degree of sparsity of the new discriminative GMM classifier with those of generative GMM classifiers, and of kernel classifiers, such as support vector machines (SVM) and relevance vector machines (RVM).
منابع مشابه
Discriminative Kernel Classifiers in Speaker Recognition
The goal of automatic speaker recognition is to identify a speaker or to verify if a speaker is the person he claims to be. We present an overview of state-of-the-art speaker recognition systems which are usually based on speakerdependent Gaussian Mixture Models (GMMs). In this paper we also describe different methods of integrating discriminative classifiers like the Support Vector Machine (SV...
متن کاملIncorporating Probability into Support Vector Machine for Speaker Recognition
Support Vector Machines (SVMs) is basically a discriminative classifiers, while it is hopefully that incorporating probability into SVMs will achieve better performance. This paper briefly reviews some of the methods that can be used to carry out the combination. By following one of them, we make it suitable for the task of speaker recognition, and Gaussian Mixture Models (GMM) is used as the g...
متن کاملRestricted Bayes Optimal Classifiers
We introduce the notion of restricted Bayes optimal classifiers. These classifiers attempt to combine the flexibility of the generative approach to classification with the high accuracy associated with discriminative learning. They first create a model of the joint distribution over class labels and features. Instead of choosing the decision boundary induced directly from the model, they restri...
متن کاملA new SVM approach to speaker identification and verification using probabilistic distance kernels
One major SVM weakness has been the use of generic kernel functions to compute distances among data points. Polynomial, linear, and Gaussian are typical examples. They do not take full advantage of the inherent probability distributions of the data. Focusing on audio speaker identification and verification, we propose to explore the use of novel kernel functions that take full advantage of good...
متن کاملLarge Margin Learning of Bayesian Classifiers Based on Gaussian Mixture Models
Abstract. We present a discriminative learning framework for Gaussian mixture models (GMMs) used for classification based on the extended Baum-Welch (EBW) algorithm [1]. We suggest two criteria for discriminative optimization, namely the class conditional likelihood (CL) and the maximization of the margin (MM). In the experiments, we present results for synthetic data, broad phonetic classifica...
متن کامل